Clustering exact matches of pairwise sequence alignments by weighted linear regression
نویسندگان
چکیده
منابع مشابه
Multiple Genome Alignment by Clustering Pairwise Matches
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome alignments, e.g, BLASTZ. Sequence clustering algorithms often generate clusters of sequences such that there exists a common shared region among all sequences in each cluster. To use a sequence clustering algorithm for gen...
متن کاملScoring Pairwise Genomic Sequence Alignments
The parameters by which alignments are scored can strongly affect sensitivity and specificity of alignment procedures. While appropriate parameter choices are well understood for protein alignments, much less is known for genomic DNA sequences. We describe a straightforward approach to scoring nucleotide substitutions in genomic sequence alignments, especially human-mouse comparisons. Scores ar...
متن کاملDomain Identification by Clustering Sequence Alignments
MOTIVATION As sequence databases grow rapidly, results from sequence comparison searches using fast search methods such as BLAST and FASTA tend to be long and difficult to digest. RESULTS In this paper, we present a new method to extract domain information from sequence comparison searches by clustering the resulting alignments according to their similarity to the query sequence. Efficient tr...
متن کاملGlobal Pairwise Sequence Alignments with Multiple Scoring Matrices
A necessity of repeating alignments on a same pair of sequences to select an appropriate scoring function to detect a significance of score motivates us to work on higher performance matching technique. While overlapping each alignments obtained through a set of typical scoring matrix with its default gap cost, we observe significant parameters that may induce a maximum deviation from a referen...
متن کاملMulticlass Linear Dimension Reduction by Weighted Pairwise Fisher Criteria
ÐWe derive a class of computationally inexpensive linear dimension reduction criteria by introducing a weighted variant of the well-known K-class Fisher criterion associated with linear discriminant analysis (LDA). It can be seen that LDA weights contributions of individual class pairs according to the Euclidian distance of the respective class means. We generalize upon LDA by introducing a dif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2008
ISSN: 1471-2105
DOI: 10.1186/1471-2105-9-102